- bounded predicate
- мат.ограниченный предикат
English-Russian scientific dictionary. 2008.
bounded predicate
Смотреть что такое "bounded predicate" в других словарях:
Predicate (grammar) — In traditional grammar, a predicate is one of the two main parts of a sentence (the other being the subject, which the predicate modifies). In current linguistic semantics, a predicate is an expression that can be true of something. Thus, the… … Wikipedia
Bounded quantifier — In the study of formal theories in mathematical logic, bounded quantifiers are often added to a language. These are two quantifiers in addition to forall and exists. They are motivated by the fact that determining whether a sentence with only… … Wikipedia
μ operator — In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Contents 1 Definition 2 Properties 3 Examples … Wikipedia
Μ operator — In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Definition Suppose that R( y, x1 , . . ., xk ) is a fixed k+1 ary relation on the natural… … Wikipedia
Non-standard analysis — Abraham Robinson Gottfried Wilhelm Leibniz argued tha … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Critique of Pure Reason — Part of a series on Immanuel … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
László Kalmár — (March 271905 August 21976) was a Hungarian mathematician and Professor at the University of Szeged. Kalmár is considered the founder of mathematical logic and theoretical Computer Science in Hungary. His early life mixed promise and tragedy. His … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
